Cs880: Approximations Algorithms 7.2 Max-cut 7.2.1 the Problem
نویسنده
چکیده
Local search is a heuristic technique for solving hard optimization problems and is widely used in practice. Suppose that a certain optimization problem can be formulated as finding a solution maximizing an objective function in the solution space. A local search algorithm for this problem would start from an arbitrary or carefully chosen solution, then iteratively move to other solutions by making small, local changes to the solution, each time increasing the objective function value, until a local optimum is found.
منابع مشابه
Cs880: Approximations Algorithms 29.1 Vertex Cover
In the previous lecture we introduced probabilistically checkable proofs (PCPs) and saw how they could be used to obtain a tight inapproximability result for MAX-3SAT. We also introduced Hastad’s 3-bit PCP, a very useful tool for proving inapproximability results. In this lecture we apply Hastad’s 3-bit PCP to show that approximating Vertex Cover within any constant factor less than 7/6 is NP-h...
متن کامل7.1 Introduction 7.2 Weighted Max Cut
In Lecture 2, we discussed the unweighted max cut problem and gave 2-approximation algorithms based on local search, greedy paradigm and randomization. Today, we will study the weighted version of the max cut problem. Using this problem we will illustrate a general technique of bounding the running time of a local search based algorithm at the expense of a small factor in the approximation guar...
متن کاملNew lower bounds for Approximation Algorithms in the Lovász-Schrijver Hierarchy
Determining how well we can efficiently compute approximate solutions to NPhard problems is of great theoretical and practical interest. Typically the famous PCP theorem is used for showing that a problem has no algorithms computing good approximations. Unfortunately, for many problem this approach has failed. Nevertheless, for such problems, we may instead be able to show that a large subclass...
متن کاملCs880: Approximations Algorithms
Last time we discussed how LP-duality can be applied to approximation. We introduced the primaldual method for approximating the optimal solution to an LP in a combinatorial way. We applied this technique to give another 2-approximation for the Vertex Cover problem. In this lecture, we present and analyze a primal-dual algorithm that gives a 2-approximation for the Steiner Forest problem. We al...
متن کاملLow-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints. We use this in particular to find k-cuts of graphs of maximum degree ∆ that cut at least a k−1 k (1 + 1 2∆+k−1 ) fraction of the edges, improving previous bounds known. The partitions also apply to constraint networks, for which we gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007